Orphans in Forests of Linear Fractional Transformations
نویسندگان
چکیده
منابع مشابه
Orphans in Forests of Linear Fractional Transformations
A positive linear fractional transformation (PLFT) is a function of the form f(z) = az+b cz+d where a, b, c and d are nonnegative integers with determinant ad− bc 6= 0. Nathanson generalized the notion of the Calkin-Wilf tree to PLFTs and used it to partition the set of PLFTs into an infinite forest of rooted trees. The roots of these PLFT Calkin-Wilf trees are called orphans. In this paper, we...
متن کاملContractivity of linear fractional transformations
One possible approach to exact real arithmetic is to use linear fractional transformations (LFT's) to represent real numbers and computations on real numbers. Recursive expressions built from LFT's are only convergent (i.e., denote a well-deened real number) if the involved LFT's are suuciently contractive. In this paper, we deene a notion of contrac-tivity for LFT's. It is used for convergence...
متن کاملDifferential Subordinations for Fractional- Linear Transformations
We establish that the differential subordinations of the forms p(z)+γzp′(z)≺ h(A1,B1;z) or p(z)+γzp′(z)/p(z) ≺ h(A2,B2;z) implies p(z) ≺ h(A,B;z), where γ ≥ 0 and h(A,B;z)= (1+Az)/(1+Bz) with −1≤ B <A.
متن کاملLinear Fractional Transformations of Circular Domains in Operator Spaces
0. Introduction Our object is to study domains which are the region of negative definiteness of an operator-valued Hermitian form defined on a space of operators and to investigate the biholomorphic linear fractional transformations between them. This is a unified setting in which to consider operator balls, operator half-planes, strictly J-contractive operators, strictly J-dissipative operator...
متن کاملThe Theory of Linear Fractional Transformations of Rational Quadratics
A standard technique for solving the recursion xn+1 = g (xn) where g : C→ C is a complex function is to first find a fairly simple function g : C→ C and a bijection f : C→ C such that g = f◦g◦f−1 where ◦ is the composition of functions. Then xn = g (x0) = (f ◦ g ◦ f−1) (x0) where g and g are the n-fold composition of functions and g is fairly easy to compute. With this motivation we find all pa...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Electronic Journal of Combinatorics
سال: 2016
ISSN: 1077-8926
DOI: 10.37236/5684